Region-based Discrete Geometry

نویسنده

  • Michael B. Smyth
چکیده

This paper is an essay in axiomatic foundations for discrete geometry intended, in principle, to be suitable for digital image processing and (more speculatively) for spatial reasoning and description as in AI and GIS. Only the geometry of convexity and linearity is treated here. A digital image is considered as a nite collection of regions; regions are primitive entities (they are not sets of points). The main result (Theorem 20) shows that nite spaces are su cient. The theory draws on both \region-based topology" (also known as mereotopology) and abstract convexity theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Discrete Singular Convolution Method for the Seepage Analysis in Porous Media with Irregular Geometry

A novel discrete singular convolution (DSC)  formulation  is  presented for the seepage analysis in irregular geometric porous media. The DSC is a new promising numerical approach which has been recently applied to solve several engineering problems. For a medium with regular geometry, realizing of the DSC for the seepage analysis is straight forward. But DSC implementation for a medium with ir...

متن کامل

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

Electronic Transmission Wave Function of Disordered Graphene by Direct Method and Green's Function Method

We describe how to obtain electronic transport properties of disordered graphene, including the tight binding model and nearest neighbor hopping. We present a new method for computing, electronic transport wave function and Greens function of the disordered Graphene. In this method, based on the small rectangular approximation, break up the potential barriers in to small parts. Then using the f...

متن کامل

توسعه مدل شبکه -دانه مجزای بتن برای سنگدانه‌های غیردایروی

In this paper, Lattice-Discrete Particle Model (LDPM) of concrete has been extended in 2-D to account for the effect of non-circular aggregates. To this end, the flexible equation of super-ellipse is employed for generating aggregates in order to add the simulation possibility of a greater spectrum of aggregate samples in 2-D to lattice-Discrete particle Model. Alongside this extention, require...

متن کامل

CONFIGURATION OPTIMIZATION OF TRUSSES USING A MULTI HEURISTIC BASED SEARCH METHOD

Different methods are available for simultaneous optimization of cross-section, topology and geometry of truss structures. Since the search space for this problem is very large, the probability of falling in local optimum is considerably high. On the other hand, different types of design variables (continuous and discrete) lead to some difficulties in the process of optimization. In this articl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2000